Vector Games with Potential Function
نویسندگان
چکیده
منابع مشابه
Vector Games with Potential Function
The theory of non cooperative games with potential function was introduced by Monderer and Shapley in 1996. Such games have interesting properties, among which is the existence of equilibria in pure strategies. The paper by Monderer and Shapley has inspired many game theory researchers. In the present paper, many classes of multiobjective games with potential functions are studied. The notions ...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولZero - Sum Games with Vector - Valued Payoffs
In this lecture we formulate and prove the celebrated approachability theorem of Blackwell, which extends von Neumann's minimax theorem to zero-sum games with vector-valued payoffs [1]. (The proof here is based on the presentation in [2]; a similar presentation was given by Foster and Vohra [3].) This theorem is powerful in its own right, but also has significant implications for regret minimiz...
متن کاملAttainability in Repeated Games with Vector Payoffs
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payoffs. A set of payoff vectors is called attainable by a player if there is a finite horizon T such that the player can guarantee that after time T the distance between the set and the cumulative payoff is arbitrarily small, regardless of the strategy Player 2 is using. We provide a necessary and s...
متن کاملUnit Vector Games
McLennan and Tourky (2010) showed that “imitation games” provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke–Howson algorithm. In an imitation game, the payoff matrix of one of the players is the identity matrix. We study the more general “unit vector games”, which are already known, where the payoff matrix of one player is composed of unit vectors. Our mai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games
سال: 2017
ISSN: 2073-4336
DOI: 10.3390/g8040040